Non-quasi-convex problems in nonlinear elastostatics
نویسندگان
چکیده
منابع مشابه
A Conceptual Framework for Problems in Elastostatics
Carnegie Mellon University, Pittsburgh, PA, USA. E-:mail: [email protected] . Abstract. In finite elasticity, the traditional local boundary-value problems are rarely appropriate. More often one has to consider non-local environmental loads. This paper gives a general description of schemes for formulating such non-local problems. Interesting examples are cavity problems, special cases of whi...
متن کاملSolving Multistage Mixed Nonlinear Convex Stochastic Problems
We present an algorithm to solve multistage stochastic convex problems, whose objective function and constraints are nonlinear. It is based on the twin-node-family concept involved in the Branch-and-Fix Coordination method. These problems have 0–1 mixed-integer and continuous variables in all the stages. The non-anticipativity constraints are satisfied bymeans of the twin-nodefamily strategy. I...
متن کاملA Quasi-Newton Penalty Barrier Method for Convex Minimization Problems
We describe an infeasible interior point algorithm for convex minimization problems. The method uses quasi-Newton techniques for approximating the second derivatives and providing superlinear convergence. We propose a new feasibility control of the iterates by introducing shift variables and by penalizing them in the barrier problem. We prove global convergence under standard conditions on the ...
متن کاملQuasi-Equilibria in Markets with Non-Convex Preferences
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at . http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive...
متن کاملInexact subgradient methods for quasi-convex optimization problems
In this paper, we consider a generic inexact subgradient algorithm to solve a nondifferentiable quasi-convex constrained optimization problem. The inexactness stems from computation errors and noise, which come from practical considerations and applications. Assuming that the computational errors and noise are deterministic and bounded, we study the effect of the inexactness on the subgradient ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Applied Mathematics
سال: 1983
ISSN: 0196-8858
DOI: 10.1016/0196-8858(83)90016-7